Optimal problem-solving search : all-or-none solutions
نویسنده
چکیده
Optimal algorithms are derived for safisficing problem-solving search, that is, search where the goal is to reach any. solution, no distinction being made among differ-ent solutions. This task is quite different from search for best solutions or shortest path solutions. L:onstraints mav be placed on the order in which sittes may be searched. This paper treats salisficing searches through partially urdered search spaces where there are multiple alternative goals. (1) Simon was c.upported in pait by Research Grant MH-07722 from the National Institule of Mental Health and in port by the Advanced Research Projecls Agency of the Office of the Secretary of Defense (F14620-73-C-0074) which is monitored by the Air Force Office of Scientific Research; Kadane was supported in part by ihe Office of Naval Research under contract number NOC0i4-67-A-0314-002. //
منابع مشابه
Optimal Problem-Solving Search: All-Oor-None Solutions
Optimal algorithms are derived for safisficing problem-solving search, that is, search where the goal is to reach any. solution, no distinction being made among differ-ent solutions. This task is quite different from search for best solutions or shortest path solutions. L:onstraints mav be placed on the order in which sittes may be searched. This paper treats salisficing searches through partia...
متن کاملA Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملAn Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
متن کامل